Looking at mean payoff through foggy windows
نویسندگان
چکیده
منابع مشابه
Looking at Mean-Payoff and Total-Payoff through Windows
We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional meanpayoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidabl...
متن کاملMean-Payoff Automaton Expressions
Quantitative languages are an extension of boolean languages that assign to each word a real number. Mean-payoff automata are finite automata with numerical weights on transitions that assign to each infinite path the long-run average of the transition weights. When the mode of branching of the automaton is deterministic, nondeterministic, or alternating, the corresponding class of quantitative...
متن کاملIncentive Stackelberg Mean-Payoff Games
We introduce and study incentive equilibria for multi-player meanpayoff games. Incentive equilibria generalise well-studied solution concepts such as Nash equilibria and leader equilibria (also known as Stackelberg equilibria). Recall that a strategy profile is a Nash equilibrium if no player can improve his payoff by changing his strategy unilaterally. In the setting of incentive and leader eq...
متن کاملLooking at quasars through galaxies
Observations of quasars (QSOs) shining through or close to galaxies offer a way to probe the properties of the foreground matter through dust extinction and gravitational lensing. In this paper the feasibility of measuring the dust extinction properties is investigated using the backlitting of QSOs. We test our method to search for QSOs affected by intervening extinction, by matching the coordi...
متن کاملThe Complexity of Mean Payoff Games
1 I n t r o d u c t i o n Let G = (V, E) be a finite directed graph in which each vertex has at least one edge going out of it. Let w : E , { W , . . . , 0 , . . . , W} be a function that assigns an integral weight to each edge of G. Ehrenfeucht and Mycielski [EM79] studied the following infinite two-person game played on such a graph. The game starts at a vertex a0 E V. The first player choose...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2017
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-017-0304-7